<TITLE>prob010: social golfer problem</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob010: social golfer problem</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.csse.monash.edu.au/~wharvey/">
          <B>Warwick Harvey</B></A>
          <ADDRESS><a href="mailto:wharvey@cs.monash.edu.au">
          wharvey@cs.monash.edu.au</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> References </H3>

This benchmark is derived from a 
<A HREF="http://x12.dejanews.com/[ST_rn=qs]/getdoc.xp?AN=356846633&CONTEXT=919361949.1703739595&hitnum=0"> 
question</A>
posted to sci.op-research by bigwind777@aol.com (Bigwind777) in May 1998. 
It is a generalisation of the problem of constructing a
round-robin tournament schedule, where the number 
of players in a "game" is
more than two. The optimal solution for 32 golfers is not yet known.

<P>

Clearly, since a golfer plays with 3 new people each week, the schedule 
cannot exceed 10 weeks.  The best solution of which I am aware is from 
Stefano Novello (<a href="mailto:S.Novello@ic.ac.uk">
S.Novello@ic.ac.uk</a>) who posted a 9-week 
<a href="solution">solution</a>, along 
with the 
<A HREF="http://www.icparc.ic.ac.uk/eclipse/examples/golf.pl.txt"> 
source</A>
of the ECLiPSe program used to find it.  
The ``challenge'' therefore 
is to find a 10-week solution, or prove none exists.


<P>



<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


